منابع مشابه
Hamiltonian Colorings of Graphs with Long Cycles
By a hamiltonian coloring of a connected graph G of order n > 1 we mean a mapping c of V (G) into the set of all positive integers such that |c(x) − c(y)| > n − 1 − DG(x, y) (where DG(x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ G. In this paper we study hamiltonian colorings of non-hamiltonian connected graphs with long cycles, mainly of connected graphs of or...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملRecognizable colorings of graphs
Let G be a connected graph and let c : V (G) → {1, 2, . . . , k} be a coloring of the vertices of G for some positive integer k (where adjacent vertices may be colored the same). The color code of a vertex v of G (with respect to c) is the ordered (k+1)-tuple code(v) = (a0, a1, . . . , ak) where a0 is the color assigned to v and for 1 ≤ i ≤ k, ai is the number of vertices adjacent to v that are...
متن کاملNested colorings of graphs
We develop a new upper bound, called the nested chromatic number, for the chromatic number of a finite simple graph. This new invariant can be computed in polynomial time, unlike the standard chromatic number which is NP -hard. We further develop multiple distinct bounds on the nested chromatic number using common properties of graphs. We also determine the behavior of the nested chromatic numb...
متن کاملOrthogonal Colorings of Graphs
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must have distinct colors in c2. The notion of orthogonal colorings is strongly related to the notion of orthogonal Latin squares. The orthogonal chromatic number of G, denoted by Oχ(G), is the minimum possible number of color...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.08.007